Modifier and Type | Method and Description |
---|---|
NB3Node |
NB3Algorithm.addLabelsToTree(java.util.List<java.lang.Object> branchLabels)
Adds a branch to the tree that contains the given labels.
|
NB3Node |
NB3Node.getParent() |
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<NB3Node> |
NB3Node.getBranch()
Returns a list containing the nodes in the path from the root to this node (excluding the root itself)
The first element is a direct child of the root node, and the last element is this node.
|
Modifier and Type | Method and Description |
---|---|
void |
NB3Algorithm.calculateBounds(NB3Node node,
java.util.ArrayList<NB3Node> branch,
NB3AgentSet pa) |
float |
NB3Algorithm.calculateProbability(NB3Node node,
int ag)
Calculates the probability that agent ag will accept the plan corresponding to the node.
|
int |
NB3Node.compareTo(NB3Node x)
Compare according to the expansion heuristic.
|
Modifier and Type | Method and Description |
---|---|
abstract java.util.List<? extends NB3Action> |
NB3Algorithm.branch2actions(java.util.List<NB3Node> branch)
Converts NodeLabels into Actions.
|
void |
NB3Algorithm.calculateBounds(NB3Node node,
java.util.ArrayList<NB3Node> branch,
NB3AgentSet pa) |
abstract float |
NB3Algorithm.calculateIntermediateValue(int agentID,
java.util.List<NB3Node> branch,
NB3WorldState ws) |
abstract float |
NB3Algorithm.calculateLowerBound(int agentID,
java.util.List<NB3Node> branchs,
NB3WorldState ws) |
abstract float |
NB3Algorithm.calculateUpperBound(int agentID,
java.util.List<NB3Node> branch,
NB3WorldState ws) |
abstract NB3AgentSet |
NB3Algorithm.getParticipatingAgents(java.util.ArrayList<NB3Node> branch)
Necessary in order to create a proposal object (which needs to know the pa in order to determine whether how
many agents still need to accept).
|